Visual Wikipedia: Landmark Detection for Cities

نویسندگان

  • Aayush Bansal
  • Akanksha Saran
چکیده

When people visit a certain city there are some particular places that strike to their tourist appeal and these places summarize the city, in some sense, for them. We want to automatically summarize the tourist appeal for cities by singling out these visually striking landmarks along with a brief verbal description for them. Earlier applications have looked at finding visual distinction between cities, but we are aiming at identifying distinctions within the local domain. We divide the city in blocks on the basis of its latitude and longitude, and try to find out those blocks which have more unusual or interesting visual information as compared to the rest. By intuition, all the interesting places must be exclusive to their own blocks hence must get highlighted upon comparison with the rest of the dataset. Using our approach we were able to find a few landmarks for a portion of Paris and Pittsburgh which are shown in the form of heat maps. We also try to find out the similarities or patterns between these two cities and see if these unusual places follow a certain theme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Landmarks by Exploiting Social Media

This paper introduces methods for automatic annotation of landmark photographs via learning textual tags and visual features of landmarks from landmark photographs that are appropriately location-tagged from social media. By analyzing spatial distributions of text tags from Flickr’s geotagged photos, we identify thousands of tags that likely refer to landmarks. Further verification by utilizing...

متن کامل

Dijkstra's algorithm - Wikipedia, the free encyclopedia

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of...

متن کامل

Verbalizing, visualizing, and navigating: The effect of strategies on encoding a large-scale virtual environment.

Using novel virtual cities, we investigated the influence of verbal and visual strategies on the encoding of navigation-relevant information in a large-scale virtual environment. In 2 experiments, participants watched videos of routes through 4 virtual cities and were subsequently tested on their memory for observed landmarks and their ability to make judgments regarding the relative directions...

متن کامل

Reliable Mobile Robot Navigation From Unreliable Visual

Vision-based mobile robot navigation requires robust methods for planning and executing tasks due to the un-reliability of visual information. In this paper we propose a new method for reliable vision-based navigation in an unmodeled dynamic environment. Artiicial landmarks are used as visual cues for navigation. Our system builds a visibility graph among landmark locations during an exploratio...

متن کامل

Reliable Mobile Robot Navigation from Unreliable Visual Cues

Vision-based mobile robot navigation requires robust methods for planning and executing tasks due to the un-reliability of visual information. In this paper we propose a new method for reliable vision-based navigation in an unmodeled dynamic environment. Artiicial landmarks are used as visual cues for navigation. Our system builds a visibility graph among landmark locations during an exploratio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014